Polarity-based graph neural network for sign prediction in signed bipartite graphs

نویسندگان

چکیده

Abstract As a fundamental data structure, graphs are ubiquitous in various applications. Among all types of graphs, signed bipartite contain complex structures with positive and negative links as well settings, on which conventional graph analysis algorithms no longer applicable. Previous works mainly focus unipartite or unsigned separately. Several models proposed for applications the by utilizing heuristic structural information. However, these methods have limited capability to fully capture information hidden such graphs. In this paper, we propose first neural network namely Polarity-based Graph Convolutional Network (PbGCN), sign prediction task help balance theory. We introduce novel polarity attribute based construct one-mode projection allow GNNs aggregate between same type nodes. Extensive experiments five datasets demonstrate effectiveness our techniques.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Signed Degree Sequences in Signed Bipartite Graphs

A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V ) be a signed bipartite graph with U = {u1, u2, · · · , up} and V = {v1, v2, · · · , vq} . Then signed degree of ui is sdeg(ui) = di = d + i − d − i , where 1 ≤ i ≤ p and d+i ( d − i ) is the number of positive(negative) edges incident with ui , and signed degree of vj is sdeg(...

متن کامل

Signed degree sets in signed bipartite graphs

A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...

متن کامل

Signed analogs of bipartite graphs

Thomas Zaslavsky Binghamton University Binghamton, New York, U.S.A. 13902-6000 September 1991 Revised July 1996 Abstra t We hara terize the edge-signed graphs in whi h every \signi ant" positive losed walk (or ombination of walks) has even length, under seven di erent riteria for signi an e, and also those edge-signed graphs whose double overing graph is bipartite. If the property of even lengt...

متن کامل

A Note on Signed Degree Sets in Signed Bipartite Graphs

A signed bipartite graph G(U, V ) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V ) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V ) is called its signed degree set. In this paper, we prove that every set ...

متن کامل

Maximum Frustration in Bipartite Signed Graphs

A signed graph is a graph where each edge is labeled as either positive or negative. A circle is positive if the product of edge labels is positive. The frustration index is the least number of edges that need to be removed so that every remaining circle is positive. The maximum frustration of a graph is the maximum frustration index over all possible sign labellings. We prove two results about...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: World Wide Web

سال: 2022

ISSN: ['1573-1413', '1386-145X']

DOI: https://doi.org/10.1007/s11280-022-01015-4